38 research outputs found
Stability of Scheduled Multi-access Communication over Quasi-static Flat Fading Channels with Random Coding and Independent Decoding
The stability of scheduled multiaccess communication with random coding and
independent decoding of messages is investigated. The number of messages that
may be scheduled for simultaneous transmission is limited to a given maximum
value, and the channels from transmitters to receiver are quasi-static, flat,
and have independent fades. Requests for message transmissions are assumed to
arrive according to an i.i.d. arrival process. Then, we show the following: (1)
in the limit of large message alphabet size, the stability region has an
interference limited information-theoretic capacity interpretation, (2)
state-independent scheduling policies achieve this asymptotic stability region,
and (3) in the asymptotic limit corresponding to immediate access, the
stability region for non-idling scheduling policies is shown to be identical
irrespective of received signal powers.Comment: 5 pages, 1 figure, To be presented at 2005 IEEE International
Symposium on Information Theory, corrected versio
Stability of Scheduled Message Communication over Degraded Broadcast Channels
We consider scheduled message communication over a discrete memoryless
degraded broadcast channel. The framework we consider here models both the
random message arrivals and the subsequent reliable communication by suitably
combining techniques from queueing theory and information theory. The channel
from the transmitter to each of the receivers is quasi-static, flat, and with
independent fades across the receivers. Requests for message transmissions are
assumed to arrive according to an i.i.d. arrival process. Then, (i) we derive
an outer bound to the region of message arrival vectors achievable by the class
of stationary scheduling policies, (ii) we show for any message arrival vector
that satisfies the outerbound, that there exists a stationary
``state-independent'' policy that results in a stable system for the
corresponding message arrival process, and (iii) under two asymptotic regimes,
we show that the stability region of nat arrival rate vectors has
information-theoretic capacity region interpretation.Comment: 5 pages, Submitted to 2006 International Symposium on Information
Theor
Algorithms for Stochastic Games on Interference Channels
We consider a wireless channel shared by multiple transmitter-receiver pairs.
Their transmissions interfere with each other. Each transmitter-receiver pair
aims to maximize its long-term average transmission rate subject to an average
power constraint. This scenario is modeled as a stochastic game. We provide
sufficient conditions for existence and uniqueness of a Nash equilibrium (NE).
We then formulate the problem of finding NE as a variational inequality (VI)
problem and present an algorithm to solve the VI using regularization. We also
provide distributed algorithms to compute Pareto optimal solutions for the
proposed game
Optimal Energy Management Policies for Energy Harvesting Sensor Nodes
We study a sensor node with an energy harvesting source. The generated energy
can be stored in a buffer. The sensor node periodically senses a random field
and generates a packet. These packets are stored in a queue and transmitted
using the energy available at that time. We obtain energy management policies
that are throughput optimal, i.e., the data queue stays stable for the largest
possible data rate. Next we obtain energy management policies which minimize
the mean delay in the queue.We also compare performance of several easily
implementable sub-optimal energy management policies. A greedy policy is
identified which, in low SNR regime, is throughput optimal and also minimizes
mean delay.Comment: Submitted to the IEEE Transactions on Wireless Communications; 22
pages with 10 figure
A schedule-based approach for flow-control in data communication networks
Thesis (Sc. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1986.MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERINGBibliography: leaves 114-117.by Utpal Mukherji.Sc.D
Optimal scheduling for balancing buffer occupancy at an ATM access point
Proceedings of the International Conference on Information, Communications and Signal Processing, ICICS2649-65327